Inexact inverse iteration for symmetric matrices
نویسندگان
چکیده
منابع مشابه
Inexact Inverse Iteration for Symmetric Matrices
In this paper we analyse inexact inverse iteration for the real symmetric eigenvalue problem Av = λv. Our analysis is designed to apply to the case when A is large and sparse and where iterative methods are used to solve the shifted linear systems (A − σI)y = x which arise. We rst present a general convergence theory that is independent of the nature of the inexact solver used. Next we consider...
متن کاملA New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملa new inexact inverse subspace iteration for generalized eigenvalue problems
in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملInverse Iteration on Defective Matrices
Very often, inverse iteration is used with shifts to accelerate convergence to an eigenvector. In this paper, it is shown that, if the eigenvalue belongs to a nonlinear elementary divisor, the vector sequences may diverge even when the shift sequences converge to the eigenvalue. The local behavior is discussed through a 2 X 2 example, and a sufficient condition for the convergence of the vector...
متن کاملThe preconditioned inverse iteration for hierarchical matrices
The preconditioned inverse iteration [Ney01a] is an efficient method to compute the smallest eigenpair of a symmetric positive definite matrix M . Here we use this method to find the smallest eigenvalues of a hierarchical matrix [Hac99]. The storage complexity of the datasparse H-matrices is almost linear. We use H-arithmetic to precondition with an approximate inverse of M or an approximate Ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2006
ISSN: 0024-3795
DOI: 10.1016/j.laa.2005.11.019